#include <bits/stdc++.h>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
void solve();
int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    std::ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
    while (T--)
    {
        solve();
    }
    return 0;
}

void solve()
{
    int n;
    std::cin >> n;
    std::vector<int> count(100001);
    for (int i = 1; i <= n; ++i)
    {
        int x;
        std::cin >> x;
        ++count[x];
    }
    int left = count[1];
    for (int i = 2; i <= 100000; ++i)
    {
        if (count[i] >= left)
        {
            left = 0;
        }
        else
        {
            left -= count[i];
        }
        left += count[i];
    }
    cout << left << endl;
    return;
}
/* 100pts
    Stats:
    SAMPLE      TIME    MEMORY
    duel1.in   0.00s    3.460M
    duel2.in   0.00s    3.400M
    duel3.in   0.00s    3.552M
    duel4.in   0.01s    3.628M
*/